Regulated variants of limited context restarting automata

Restarting Automata and Variants of j-Monotonicity

In the literature various notions of (non-) monotonicity of restarting automata have been studied. Here we introduce two new variants of (non-) monotonicity for restarting automata and for two-way restarting automata: left (non-) monotonicity and right-left (non-) monotonicity. It is shown that for the various types of deterministic and nondeterministic (two-way) restarting automata without aux...

Restarting Tree Automata and Linear Context-Free Tree Languages

Restarting Tree Automata

Lookahead Hierarchies of Restarting Automata

The restarting automaton is a special kind of the linear bounded automaton with a read/write window of fixed length. It works in cycles, reducing the length of the actual word in each cycle. We study several versions of restarting automata and we show several hierarchies of language classes recognized by them with respect to the size of the read/write-window.

CD-Systems of Restarting Automata